A fast algorithm for multiplying min-sum permutations
نویسندگان
چکیده
منابع مشابه
Fast, Parallel Algorithm for Multiplying Polynomials with Integer Coefficients
This paper aims to develop and analyze an effective parallel algorithm for multiplying polynomials and power series with integer coefficients. Such operations are of fundamental importance when generating parameters for public key cryptosystems, whereas their effective implementation translates directly into the speed of such algorithms in practical applications. The algorithm has been designed...
متن کاملFast Algorithm for Multiple-objects Min- Problem
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is based on iterative reduced-search dynamic programming introduced earlier for the minproblem of a single polygonal curve. The proposed algorithm jointly optimizes the number of line segments allocated to the different individual curves, and the approximation of the curves by the given number of se...
متن کاملConvergence of the Min-Sum Algorithm for Convex Optimization
We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.
متن کاملMin-Sum algorithm for lattices constructed by Construction D
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D ′ . We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding complexity per iteration, in terms of coding gain, label group sizes of the lattice and other factors is derived. We show that iterative decoding of LDGM lattices ...
متن کاملSimplified 2-Dimensional Scaled Min-Sum Algorithm for LDPC Decoder
Among various decoding algorithms of low-density parity-check (LDPC) codes, the minsum (MS) algorithm and its modified algorithms are widely adopted because of their computational simplicity compared to the sum-product (SP) algorithm with slight loss of decoding performance. In the MS algorithm, the magnitude of the output message from a check node (CN) processing unit is decided by either the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.06.022